The 2-hop spanning tree problem

The 2-hop spanning tree problem

Given a graph G with a speciied root node r. A spanning tree in G where each node has distance at most 2 from r is called a 2-hop spanning tree. For given edge weights the 2-hop spanning tree problem is to nd a minimum weight 2-hop spanning tree. The problem is NP-hard and has some interesting applications. We study a polytope associated with a directed model of the problem give a completeness ...

of Informatics The 2 - hop spanning tree problem . Geir Dahl

Given a graph G with a speci ed root node r. A spanning tree in G where each node has distance at most 2 from r is called a 2-hop spanning tree. For given edge weights the 2-hop spanning tree problem is to nd a minimum weight 2-hop spanning tree. The problem is NP-hard and has some interesting applications. We study a polytope associated with a directed model of the problem give a completeness ...

The 2 - hop spanning tree problem . Geir Dahl

Given a graph G with a speciied root node r. A spanning tree in G where each node has distance at most 2 from r is called a 2-hop spanning tree. For given edge weights the 2-hop spanning tree problem is to nd a minimum weight 2-hop spanning tree. The problem is NP-hard and has some interesting applications. We study a polytope associated with a directed model of the problem give a completeness ...

Minimum spanning tree with hop restri

Modelling the hop-constrained minimum spanning tree problem over a layered graph

The Hop-constrained Minimum Spanning Tree Problem (HMST) is defined as follows: given a graph G = (V,E) with node set V = {0, 1, . . . , n} and edge set E as well as a cost ce associated with each edge e of E and a natural number H , we wish to find a spanning tree T of the graph with minimum total cost and such that the unique path from a specified root node, node 0, to any other node has no m...